Coevolutionary Learning with Spatially Distributed Populations
نویسنده
چکیده
Many approaches to machine learning require a system to learn a model from a set of training examples that the model must classify, or training problems that the model must solve. How are these training cases to be chosen? Typically, due to the costs of acquisition or computation, only a relatively small sample from the universe of possible problems is available to the learner. How should that sample be chosen? Clearly, if the problems are too easy or to difficult, the system will not make progress in learning. Ideally, the problems should be chosen to be optimally challenging for a system's current state of learning and to specifically target weaknesses in the system at a given time. In life, good teachers craft such problems for their students. The challenge in machine learning is to craft such problems automatically. Approaches to this issue in the machine learning community include active learning (Cohen et al., 1996), boosting (Freund and Schapire, 1997), and coevolutionary learning. This last approach has been surprisingly successful on a number of tasks, but lacks the theoretical underpinning of the first two. It is not well understood why coevolution works, when it will succeed, and how best to apply it. The purpose of this chapter is to briefly review some of the results to date in coevolutionary learning, and to report on recent research that explores the role of spatially extended populations in the success of coevolution. Coevolutionary learning, which builds on genetic algorithms (GAs) and other evolutionary computation techniques, has been explored by many people. The first explicit application of computational " host-parasite coevolution " was performed by Hillis (1990). Hillis's inspiration came from host-parasite coevolution in nature. One striking natural example is the phenomenon of " egg mimicry " in plants. Insects such as butterflies sometimes lay their eggs on plant leaves, providing a ready food source for newly hatched larvae. The passion flower plant has evolved a protection against such parasit-ism by producing toxic chemicals in its leaves. However, the genus of butterfly called Heliconius has evolved a counter-adaptation: its larvae are able to tolerate these chemicals. In response, the passion flower has evolved a remarkable counter-counter-adaptation: yellow spots on its leaves that resemble Heliconius eggs. In order to avoid too much food competition among larvae, butterflies will not lay eggs on leaves already crowded with eggs, and the spots on passion flower leaves fool at …
منابع مشابه
Patterns and coevolutionary consequences of repeated brood parasitism.
The absence of adaptive host responses to virulent parasites and pathogens is paradoxical. We explored the theoretical possibility that the evolution of antiparasitic egg-ejection strategies was delayed by avian hosts' lifetime experiences with brood parasitism. An analytical model indicated that individual hosts' repeated exposure to parasitism decreased the relative benefits of learning-based...
متن کاملSpatial Embedding and Loss of Gradient in Cooperative Coevolutionary Algorithms
Coevolutionary algorithms offer great promise as adaptive problem solvers but suffer from several known pathologies. Historically, spatially embedded coevolutionary algorithms seem to have succeeded where other coevolutionary approaches fail; however, explanations for this have been largely unexplored. We examine this idea more closely by looking at spatial models in the context of a particular...
متن کاملRole of coevolution in generating biological diversity: spatially divergent selection trajectories.
The Geographic Mosaic Theory of Coevolution predicts that divergent coevolutionary selection produces genetic differentiation across populations. The 29 studies reviewed here support this hypothesis as they all report spatially diverged selection trajectories which have generated variable outcomes in the interaction traits among populations. This holds for both mutualistic interactions such as ...
متن کاملOn the improvement of coevolutionary optimizers by learning variable interdependencies
During the last years, cooperating coevolutionary algorithms could improve convergence of several optimization benchmarks significantly by placing each dimension of the search space in its own subpopulation. Though, their general applicability is restricted by problems with epistatic links between problem dimensions – a major obstacle in cooperating coevolutionary function optimization. This wo...
متن کاملCoevolutionary Computation: An Introduction
Agent technology is synonymous with advanced computer software and a growing body of work exists on the use of adaptive techniques within the agent paradigm (e.g. [Kozierok & Maes 1993]). The distributed and/or multi-faceted nature of complex problem domains, such as network routing or process control, has lead to the extension of agent frameworks to multi-agent systems, both within traditional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006